#include<bits/stdc++.h>
using namespace std;
int aa[100001];
struct node{
    int ran;
    int num;
};
node a[100001];
int main(){
    freopen("duel.in","r",stdin);
    freopen("duel.out","w",stdout);
    int n;
    cin >> n;
    for(int i = 1; i <= n; i ++) cin >> aa[i];
    sort(aa+1,aa+1+n);
    //for(int i = 1; i <= n; i ++) cout << aa[i] << ' ';
    int cnt = 1;
    a[1].ran = aa[1];
    a[1].num = 1;
    for(int i = 2; i <= n; i ++){
        if(aa[i] == a[cnt].ran) a[cnt].num ++;
        else {
            cnt ++;
            a[cnt].ran = aa[i];
            a[cnt].num ++;
        }
    }
    for(int i = 1; i < cnt; i ++) a[i+1].num = max(a[i].num, a[i+1].num);
    cout << a[cnt].num << endl;
    return 0;
}
